A Hybrid Intuitionistic Logic: Semantics and Decidability
نویسندگان
چکیده
An intuitionistic, hybrid modal logic suitable for reasoning about distribution of resources was introduced in [14, 15]. The modalities of the logic allow us to validate properties in a particular place, in some place and in all places. We give a sound and complete Kripke semantics for the logic extended with disjunctive connectives. The extended logic can be seen as an instance of Hybrid IS5. We also give a sound and complete birelational semantics , and show that the semantics satisfies the finite model property: if a judgement is not valid in the logic, then there is a finite birelational countermodel. Hence we prove that the logic is decidable.
منابع مشابه
AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC
In this paper we extend the notion of degrees of membership and non-membership of intuitionistic fuzzy sets to lattices and introduce a residuated lattice with appropriate operations to serve as semantics of intuitionistic fuzzy logic. It would be a step forward to find an algebraic counterpart for intuitionistic fuzzy logic. We give the main properties of the operations defined and prove som...
متن کاملDisjunction Property and Finite Model Property For an Intuitionistic Epistemic Logic
We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a ...
متن کاملA syntactic proof of decidability for the logic of bunched implication BI
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...
متن کاملA purely syntactic proof of decidability for BI
The logic of bunched implication BI provides a framework for reasoning about resource composition and forms the basis for an assertion language of separation logic which is used to reason about software programs. Propositional BI is obtained by freely combining propositional intuitionistic logic and multiplicative intuitionistic linear logic. It possesses an elegant proof theory: its bunched ca...
متن کاملOn Sequent Calculi for Intuitionistic Propositional Logic
The well-known Dyckoff’s 1992 calculus/procedure for intuitionistic propositional logic is considered and analyzed. It is shown that the calculus is Kripke complete and the procedure in fact works in polynomial space. Then a multi-conclusion intuitionistic calculus is introduced, obtained by adding one new rule to known calculi. A simple proof of Kripke completeness and polynomial-space decidab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 16 شماره
صفحات -
تاریخ انتشار 2006